Recursive sliding discrete Fourier transform with oversampled data
نویسندگان
چکیده
Article history: Available online 17 October 2013
منابع مشابه
On the Advantages of the LMS Spectrum
| Based on the least mean squares (LMS) algorithm , the LMS spectrum analyzer can be used to re-cursively calculate the discrete Fourier transform (DFT) of a sliding window of data. In this paper, we compare the LMS spectrum analyzer with the straightforward non-adaptive implementation of the recursive DFT. In particular , we demonstrate the robustness of the LMS spectrum analyzer to the propag...
متن کاملRFT : a simplified fast real-time sliding DFT algorithm
This paper presents a variant of the Discrete Fourier Transform (DFT) that is particularly destined for the implementation in embedded applications, which are characterized by limited resources in terms of memory and computing speed. Often these applications are highly specialized and require therefore an optimal relationship between costs and performance. It surely is of great interest to disp...
متن کاملSliding discrete fractional transforms
Fractional transforms are useful tools for processing of non-stationary signals. The methods of implementing sliding discrete fractional Fourier transform (SDFRFT), sliding discrete fractional cosine transform (SDFRCT) and sliding discrete fractional sine transform (SDFRST) for real time processing of signals are presented. The performances of these sliding transforms, with regard to computatio...
متن کاملEfficient Spectral Analysis of Quasi Stationary Time Series
Power Spectral Density (PSD) of quasi-stationary processes can be efficiently estimated using the short time Fourier series (STFT). In this paper, an algorithm has been proposed that computes the PSD of quasi-stationary process efficiently using offline autoregressive model order estimation algorithm, recursive parameter estimation technique and modified sliding window discrete Fourier Transfor...
متن کاملShort-term Spectral Analysis and Synthesis improvements with oversampled inverse filter banks
The Short Term Fourier Transform (STFT) is a classical linear time-frequency (T-F) representation. Despites its relative simplicity, it has become a standard tool for the analysis of non-stationary signals. Since it provides a redundant representation, it raises some issues such as (i) “optimal” window choice for analysis, (ii) existence and determination of an inverse transformation, (iii) per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Digital Signal Processing
دوره 25 شماره
صفحات -
تاریخ انتشار 2014